Fast Three-Party Shared Generation of RSA Keys Without Distributed Primality Tests

Fast Fully-Distributed and Threshold RSA Function Sharing

Distributed primality tests for the purpose of testing the factors of the jointly generated RSA modulus were always considered as a nightmare due to the large amount of time required for these tests to succeed. Enormous number of trials must be performed before a suitable RSA modulus is established. In the honest-but-curious scenario, in this paper we propose an efficient extention to the three...

Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing

The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the help of a trusted dealer. The incorporated parties must agree on a suitable RSA modulus with no information revealed to them about its prime factors. Enormous number of trials must be performed before a suitable modulus i...

Efficient Dealer-Less Threshold Sharing of Standard RSA

In [15] an efficient two-party, two-prime RSA function sharing protocol was proposed. The protocol proves efficiency over previously proposed protocols. When the sharing of standard RSA is considered, the protocol is faster than ever. In this paper, under the assumption that the adversary has eavesdropping and halting capabilities, we propose an efficient extension to the protocol of [15]. Our ...

A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields

Shared Generation of Shared RSA Keys 1

The paper considers the problem of distributed key generation for shared-control RSA schemes. In particular: how can two parties generate a shared RSA key in such a way that neither party can cheat? The answer to this question would have signi cant applications to, for example, key escrow systems. Cocks has recently proposed protocols to solve this problem in the case when both parties act hone...